Labels:text | screenshot | font | number | black and white | parallel OCR: FIGURE 7: Using B-Tree indexes can result in wasted blocks in your index. This shows the report results after insertion of 10,000 rows. blkixchk.sql Alloc. Leaf Uniqueness Avg. Leof Blocks Distinct Number Index Blocks Level Blocks Avg. Data Blocks Pct. Cluster per Key per Key Keys of Rows Clustering for Rows .... .... .. .... Estimate Statistics: JKOOPMI.TEST1 PK UNIQUE 515 JKOOPMI.TESTI PI_AUDT_DT NONUNIQUE 65 1 1 94 49 1 1 10,442 9,998 116 1.16 1 1 379 9.998 112 1.12 Compute Statistics: JKOOPMI.TESTI_PK UNIQUE 1 1 9.998 9,998 JKOOPMI.TESTI_PI_AUDT_DT 90 1 NONUNIQUE 515 65 49 112 1.12 1 1 1 379 9,998 112 1.12 blkixsts.sql Usable Usable Deleted Const Space Space in Deleted Leof Most Rows Gets B-Tree Used Name Leof Blocks in Lec Branch Branch Branch Leof Rows Repeat Block Rows Blocks Block per per Rows Lengil Key Key Spooe Access Used JKOOPMI.TESTI_PI_AUDT_DT 49 3924 48 89 3956 00 JKOOPMI.TESTI_PK 3924 3956 0 38 192 98.00 90 1 0 1 16 3 345 186 342 99.00 FIGURE 8: The results after deletion of 4,998 rows. The index has the same number of leaf blocks it did when there were 10,000 rows.
